Meanders: A Direct Enumeration Approach
نویسندگان
چکیده
We study the statistics of semi-meanders, i.e. configurations of a set of roads crossing a river through n bridges, and possibly winding around its source, as a toy model for compact folding of polymers. By analyzing the results of a direct enumeration up to n = 29, we perform on the one hand a large n extrapolation and on the other hand we reformulate the available data into a large q expansion, where q is a weight attached to each road. We predict a transition at q = 2 between a low-q regime with irrelevant winding, and a large-q regime with relevant winding.
منابع مشابه
A transfer matrix approach to the enumeration of plane meanders
A closed plane meander of order n is a closed self-avoiding curve intersecting an infinite line 2n times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm, based on transfer matrix methods, for the enumeration of plane meanders. While the algorithm has exponential complexity, its rate of growth is much smaller than tha...
متن کاملEnumerations of plane meanders
A closed plane meander of order n is a closed self-avoiding loop intersecting an infinite line 2n times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm, based on transfer matrix methods, for the enumeration of plane meanders. This allows us to calculate the number of closed meanders up to n = 24. The algorithm is eas...
متن کاملCritical exponents of plane meanders
Meanders form a set of combinatorial problems concerned with the enumeration of self-avoiding loops crossing a line through a given number of points, n. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We use a recently developed algorithm, based on transfer matrix methods, to enumerate plane meanders. This allows us to calculate the number of closed meander...
متن کاملFoldings and meanders
We review the stamp folding problem, the number of ways to fold a strip of n stamps, and the related problem of enumerating meander configurations. The study of equivalence classes of foldings and meanders under symmetries allows to characterize and enumerate folding and meander shapes. We describe symmetric foldings and meanders, and we give formulas relating folding and meander sequences. We ...
متن کاملFrom Fully-Packed Loops to Meanders: Exact Exponents
We address the meander problem “enumerate all topologically inequivalent configurations of a closed nonselfintersecting plane curve intersecting a given line through a fixed number of points”. We show that meanders may be viewed as the configurations of a suitable fully-packed loop statistical model defined on a random surface. Using standard results relating critical singularities of a lattice...
متن کامل